-
Notifications
You must be signed in to change notification settings - Fork 13.8k
rustdoc: calculate effective visibilities of crates on-demand #147482
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: master
Are you sure you want to change the base?
rustdoc: calculate effective visibilities of crates on-demand #147482
Conversation
@bors2 try @rust-timer queue |
This comment has been minimized.
This comment has been minimized.
…and, r=<try> rustdoc: calculate effective visibilities of crates on-demand
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
Finished benchmarking commit (b0cbaf1): comparison URL. Overall result: ❌✅ regressions and improvements - please read the text belowBenchmarking this pull request means it may be perf-sensitive – we'll automatically label it not fit for rolling up. You can override this, but we strongly advise not to, due to possible changes in compiler perf. Next Steps: If you can justify the regressions found in this try perf run, please do so in sufficient writing along with @bors rollup=never Instruction countOur most reliable metric. Used to determine the overall result above. However, even this metric can be noisy.
Max RSS (memory usage)Results (primary 2.5%, secondary 1.7%)A less reliable metric. May be of interest, but not used to determine the overall result above.
CyclesResults (primary 2.1%, secondary -1.0%)A less reliable metric. May be of interest, but not used to determine the overall result above.
Binary sizeThis benchmark run did not return any relevant results for this metric. Bootstrap: 473.927s -> 473.682s (-0.05%) |
I'm curious how this would perform on something much larger like zed. The unfortunatly the overhead of the locking is fairly significant. there are a few different things that could be tried to mitegate that, such as using a datastructure with multiple levels of nested maps ( |
Alright, I tried a few alternatives and none worked. Could maybe be workable with a bit more effort. Also worth considering if the current change is just "good enough" already. the two-stage hashmap design didn't work because it's not actually correct, presumably because of inlined items or something similar (making it so a crate can contain DefIds that are actually from a different crate) (do we need to be traversing into inlined modules, actually?) DefIdSet is UnordSet which is not IntoIterator and provides no alternative method for merging. I guess I could use |
No description provided.